MODS: Fast and robust method for two-view matching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODS: Fast and robust method for two-view matching

A novel algorithm for wide-baseline matching called MODS – Matching On Demand with view Synthesis – is presented. The MODS algorithm is experimentally shown to solve a broader range of wide-baseline problems than the state of the art while being nearly as fast as standard matchers on simple problems. The apparent robustness vs. speed trade-off is finessed by the use of progressively more time-c...

متن کامل

Fast Method for Robust Template Matching

In this paper, we propose a fast algorithm for speeding up the process of template matching that uses M-estimators for dealing with outliers. We propose a particular image hierarchy called the p-pyramid that can be exploited to generate a list of ascending lower bounds of the minimal matching errors when a non-decreasing robust error measure is adopted. Then, the set of lower bounds can be used...

متن کامل

A Fast and Robust Scene Matching Method for Navigation

The selection of matching method is critical to the scene matching navigation system, as it determines the accuracy of navigation. A coarse-to-fine matching method, which combines the area-based and feature-based matching method, is presented to meet the requirements of navigation, including the real-time performance, the sub-pixel accuracy and the robustness. In the coarse matching stage, the ...

متن کامل

Fast Exhaustive Robust Matching

This work presents a fast exhaustive robust matching technique for aligning translated images. The key idea is to express a robust matching surface function in terms of correlation operations. Speed is obtained from computing correlations in the frequency domain. Different sized images and arbitrary shapes may be matched. The method outputs a matching surface representing the quality of match a...

متن کامل

Fast Least Square Matching

Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Vision and Image Understanding

سال: 2015

ISSN: 1077-3142

DOI: 10.1016/j.cviu.2015.08.005